Bus automata and immediate languages

Languages Automata and Logic

This paper is a survey on logical aspects of nite automata Central points are the connection between nite automata and monadic second order logic the Ehrenfeucht Fra ss e technique in the context of formal language theory nite automata on words and their determinization and a self contained proof of the Rabin Tree Theorem Sections and contain material presented in a lecture series to the Final ...

Precedence Automata and Languages

Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known visibly pushdown languages, and enjoy the same nice closure properties. We introduce here Floyd automata, an equivalent operational formalism for defining FLs. This also permits to extend the class to deal with infi...

Automata and formal languages

Minimal Partial Languages and Automata

Partial words are sequences of characters from an alphabet in which some positions may be marked with a “hole” symbol, . We can create a -substitution mapping this symbol to a subset of the alphabet, so that applying such a substitution to a partial word results in a set of full words (ones without holes). This setup allows us to compress regular languages into smaller partial languages. Determ...

Generalized Automata and Stochastic Languages

1. Introduction. In a probabilistic automaton, as defined e.g. in [2] and [l], the initial vector as well as the transition matrices are stochastic, and the final vector consists of O's and l's only. This paper is concerned with the so-called generalized automata where the elements of the initial vector, of the final vector and of the matrices are allowed to be arbitrary real numbers. Our purpo...